Regular Linear-time Temporal Logic Martin Leucker Institut f¨ur Informatik TU M¨unchenGarching, Germany Email:

Source URL: software.imdea.org

• Formal languages
• Logic in computer science
• Complexity classes
• Automata theory
• Temporal logic
• Linear temporal logic
• Modal logic
• Dynamic logic
• Model checking
• Theoretical computer science
• Mathematics
• Logic

BRICS RS-05-9 Frandsen & Miltersen: Reviewing Bounds on the Circuit Size of the Hardest Functions BRICS Basic Research in Computer Science

Source URL: www.brics.dk

• Circuit complexity
• Complexity classes
• Mathematical notation
• Computational complexity theory
• Stack
• Boolean circuit
• Summation
• NC
• ACC0
• Theoretical computer science
• Mathematics
• Applied mathematics

BRICS Basic Research in Computer Science BRICS DS-97-3 T. Husfeldt: Dynamic Computation

Source URL: www.brics.dk

• Complexity classes
• Algorithm
• Mathematical logic
• Model of computation
• PP
• Dynamic problem
• P
• ACC0
• Circuit complexity
• Theoretical computer science
• Computational complexity theory
• Applied mathematics

Microsoft Word00087_OAD-VIIRS-SIA-EDR_B.docx

Source URL: suomi.gsfc.nasa.gov

• Complexity classes
• Technical communication
• NP
• Specification
• Algorithm
• Earth
• Mathematics
• Technology
• Joint Polar Satellite System
• National Oceanic and Atmospheric Administration
• NPOESS

On the Relationship between Consistent Query Answering and Constraint Satisfaction Problems Carsten Lutz1 and Frank Wolter2 1 2

Source URL: www.informatik.uni-bremen.de

• Finite model theory
• Descriptive complexity
• Computational complexity theory
• FO
• Constraint programming
• Constraint satisfaction problem
• Conjunctive query
• SO
• HO
• Theoretical computer science
• Applied mathematics
• Complexity classes

Operational Algorithm Document for OMPS TC SDR - Updates required for Version 4.2

Source URL: suomi.gsfc.nasa.gov

• Complexity classes
• NPOESS
• Ozone Mapping and Profiler Suite
• NP
• Subroutine
• Computing
• Earth
• Joint Polar Satellite System
• National Oceanic and Atmospheric Administration

Logic and Computational Complexity 2012 INVITED SPEAKER: Etienne Grandjean TITLE: An invitation to linear time complexity ABSTRACT: The polynomial time class (PTIME) is one of the most fundamental complexity classes, gen

Source URL: ptmat.fc.ul.pt

Classification of recursive functions into polynomial and superpolynomial complexity classes Carsten Sch¨urmann Department of Computer Science Yale University New Haven, CT 06511

Source URL: www.itu.dk

BRICS Basic Research in Computer Science BRICS RSBinderup et al.: The Complexity of Identifying Large Equivalence Classes The Complexity of Identifying

Source URL: www.brics.dk